翻訳と辞書 Words near each other ・ Ski jumping at the 1976 Winter Olympics ・ Ski jumping at the 1976 Winter Olympics – Large hill individual ・ Ski jumping at the 1976 Winter Olympics – Normal hill individual ・ Ski jumping at the 1980 Winter Olympics ・ Ski jumping at the 1980 Winter Olympics – Large hill individual ・ Ski jumping at the 1980 Winter Olympics – Normal hill individual ・ Ski jumping at the 1984 Winter Olympics ・ Ski jumping at the 1984 Winter Olympics – Large hill individual ・ Ski jumping at the 1984 Winter Olympics – Normal hill individual ・ Ski jumping at the 1986 Asian Winter Games ・ Ski jumping at the 1988 Winter Olympics ・ Ski jumping at the 1988 Winter Olympics – Large hill individual ・ Ski jumping at the 1988 Winter Olympics – Large hill team ・ Ski jumping at the 1988 Winter Olympics – Normal hill individual ・ Ski jumping at the 1990 Asian Winter Games ・ Skew heap ・ Skew It on the Bar-B ・ Skew lattice ・ Skew lines ・ Skew normal distribution ・ Skew partition ・ Skew Peak ・ Skew polygon ・ Skew Siskin ・ Skew Siskin (album) ・ Skew-Hamiltonian matrix ・ Skew-Hermitian ・ Skew-Hermitian matrix ・ Skew-symmetric graph ・ Skew-symmetric matrix Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Skew heap ： ウィキペディア英語版 Skew heap A skew heap (or self-adjusting heap) is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their ability to merge more quickly than binary heaps. In contrast with binary heaps, there are no structural constraints, so there is no guarantee that the height of the tree is logarithmic. Only two conditions must be satisfied: * The general heap order must be enforced * Every operation (add, remove_min, merge) on two skew heaps must be done using a special ''skew heap merge''. A skew heap is a self-adjusting form of a leftist heap which attempts to maintain balance by unconditionally swapping all nodes in the merge path when merging two heaps. (The merge operation is also used when adding and removing values.) With no structural constraints, it may seem that a skew heap would be horribly inefficient. However, amortized complexity analysis can be used to demonstrate that all operations on a skew heap can be done in O(log n).〔http://www.cse.yorku.ca/~andy/courses/4101/lecture-notes/LN5.pdf〕 == Definition == Skew heaps may be described with the following recursive definition: *A heap with only one element is a skew heap. *The result of ''skew merging'' two skew heaps $sh\_1$ and $sh\_2$ is also a skew heap. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Skew heap」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.